Logic Programming in DataLog: A Long Tour from Theory to Practice
نویسندگان
چکیده
Il Milione: A Journey in the Computational Logic in Italy 43 SOMMARIO/ABSTRACT In questo articolo si descrivono le linee di ricerca svilup-pate a Cosenza nell'ambito della programmazione logica in un arco temporale di oltre 20 anni e che hanno portato a recenti interessanti e promettenti sviluppi industriali. Tali linee di ricerca sono cambiate nel tempo ma hanno mantenuto l'interesse iniziale per accoppiare la pro-grammazione logica con le tecnologie della basi di dati, interesse che si continuamente rinnovato per affrontare nuove sfide nell'uso della teoria per risolvere problemi pratici. In this paper, we describe the research lines in logic programming , carried out in Cosenza over a period of more than 20 years, which have recently produced promising industrial exploitation follow-ups. The research lines have changed over the time but they have kept the initial interest on combining logic programming with databases techniques , that has been continuously renewed to cope with new challenges, in our attempt to use theory to solve practical problems.
منابع مشابه
INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملQuerying incomplete data over extended ER schemata
Since Chen’s Entity-Relationship (ER) model, conceptual modeling has been playing a fundamental role in relational data design. In this paper we consider an extended ER (EER) model enriched with cardinality constraints, disjointness assertions, and is-a relations among both entities and relationships. In this setting, we consider the case of incomplete data, which is likely to occur, for instan...
متن کاملTheory and Practice of Logic Programming
FS-rules provide a powerful monotonic extension for Horn clauses that supports monotonic aggregates in recursion by reasoning on the multiplicity of occurrences satisfying existential goals. The least fixpoint semantics, and its equivalent least model semantics, hold for logic programs with FS-rules; moreover, generalized notions of stratification and stable models are easily derived when negat...
متن کاملDatalog on infinite structures
Datalog is the relational variant of logic programming and has become a standard query language in database theory. The (program) complexity of datalog in its main context so far, on finite databases, is well known to be in EXPTIME. We research the complexity of datalog on infinite databases, motivated by possible applications of datalog to infinite structures (e.g. linear orders) in temporal a...
متن کاملThe Impact of Disjunction on Reasoning under Existential Rules: Research Summary
Datalog±is a Datalog-based language family enhanced with existential quantification in rule heads, equalities and negative constraints. Query answering over databases with respect to a Datalog± theory is generally undecidable, however several syntactic restrictions have been proposed to remedy this fact. However, a useful and natural feature however is as of yet missing from Datalog±: The abili...
متن کامل